An algorithm for piece-wise indefinite quadratic programming problem
نویسندگان
چکیده
منابع مشابه
An Indefinite - Quadratic - Programming Model Fora Continuous - Production Problem
A model is presented for a problem of scheduling the lengths of N production periods on one machine, which will manufacture q products. The problem is to choose production periods so as to minimize the sum of inventory costs for the q products in the presence of given demands. Mathematically, the problem is one of minimizing an indefinite quadratic function subject to linear constraints. A nume...
متن کاملAn Algorithm for Solving an Indefinite Quadratic Transportation Problem with Specified Flow
In the present paper, an indefinite quadratic transportation problem with specified flow is studied. If in addition to the flow constraint, the minimum requirement of each destination is also specified then the situation arises of distributing at minimum cost a certain commodity produced in a country, after keeping reserve stocks, to various states with minimum requirement of each state specifi...
متن کاملA New Approach for Solving Interval Quadratic Programming Problem
This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...
متن کاملAn Algorithm for Large-Scale Quadratic Programming
We are particularly concerned in solving (1.1) when n is large and the vectors a, and matrix H are sparse. We do not restrict H to being positive (semi-)definite and consequently are content with finding local solutions to (1.1). Of course, for many classes of problem, it is known a priori that any local solution is a global one. Our method is fundamentally related to that proposed by Fletcher ...
متن کاملAn Algorithm for Solving Quadratic Programming Problems
Herein is investigated the method of solution of quadratic programming problems. The algorithm is based on the effective selection of constraints. Quadratic programming with constraintsequalities are solved with the help of an algorithm, so that matrix inversion is avoided, because of the more convenient organization of the Calculus. Optimal solution is determined in a finite number of iteratio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Croatian Operational Research Review
سال: 2020
ISSN: 1848-9931,1848-0225
DOI: 10.17535/crorr.2020.0004